منابع مشابه
Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
Using a regularized Nikaido-Isoda function, we present a (nonsmooth) constrained optimization reformulation of a class of generalized Nash equilibrium problems (GNEPs). Further we give an unconstrained reformulation of a large subclass of all GNEPs which, in particular, includes the jointly convex GNEPs. Both approaches characterize all solutions of a GNEP as minima of optimization problems. Th...
متن کاملOn Differentiability Properties of Player Convex Generalized Nash Equilibrium Problems∗
This article studies differentiability properties for a reformulation of a player convex generalized Nash equilibrium problem as a constrained and possibly nonsmooth minimization problem. By using several results from parametric optimization we show that, apart from exceptional cases, all locally minimal points of the reformulation are differentiability points of the objective function. This ju...
متن کاملIteratively computation the Nash equilibrium points in the two-player positive games
We consider the linear quadratic differential games for positive linear systems with the feedback information structure and two players. The accelerated Newton method to obtain the stabilizing solution of a corresponding set of Riccati equations is presented in [6], where the convergence properties are established. In addition, the Lyapunov iterative method to compute the Nash equilibrium point...
متن کاملOn the Existence of Nash Equilibrium for a Two Player Pursuit-Evasion Game with Visibility Constraints
In this paper, we present a game theoretic analysis of a visibility based pursuitevasion game in a planar environment containing obstacles. The pursuer and the evader are holonomic having bounded speeds. Both the players have a complete map of the environment. Both the players have omnidirectional vision and have knowledge about each other’s current position as long as they are visible to each ...
متن کاملA Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9609-z